package sort;

public class test {

    /*public static void insertsort(int[]  array){
        for (int i = 1; i < array.length-1; i++) {
            int tmp=array[i];
            int j = i;
            for (; j >=0 ; j--) {
                if (array[j]>array[i]){
                    array[j+1]=array[j];
                }else{
                    break;
                }
            }
            array[j+1]=tmp;
        }
    }*/

    public static void main(String[] args) {
        int[] array = {4, 6, 7, 8, 3, 2, 1};
        //sort.insertsort(array);
        //sort.shellSort(array);
        //sort.selectSort(array);

        //sort.heapSort(array);
        //sort.testQuickSort(array);
        //sort.mergeSort1(array);
        //sort.quickSort(array);
        sort.quickSortStack(array);
        for (int i = 0; i < array.length; i++) {
            System.out.print(array[i] + " ");
        }
    }
}
